A Novel Biometric Identification Scheme Based on Zero-Knowledge Succinct Noninteractive Argument of Knowledge
نویسندگان
چکیده
Biometric identification is a convenient and reliable method in identity authentication. The widespread adoption of biometric requires strong privacy protection against possible theft or loss data. Existing techniques for privacy-preserving mainly rely on traditional cryptographic technology such as oblivious transfer homomorphic encryption, which will incur huge expenses to the system cannot be applied large-scale practical applications. For these issues, we propose scheme by constructing zero-knowledge succinct noninteractive argument knowledge (zk-SNARK). Our not only reduces communication overhead, needs send 8 constants verifier but also can protect fingerprint template from disclosure. time complexity proof generation verification are about O(C) O x + log C , respectively, size constants, where C x represent circuit public input, respectively. We have implemented proposed authentication solution data set images evaluated performance security.
منابع مشابه
Noninteractive Zero-Knowledge
We investigate the possibility of disposing of interaction between Prover and Veriier in a zero-knowledge proof if they share beforehand a short random string. Without any assumption, we prove that non-interactive zero-knowledge proofs exist for some number theoretic languages for which no eecient algorithm is known. If deciding quadratic residuosity (modulo composite integers whose factorizati...
متن کاملA New Zero Knowledge Identification Scheme based on Weil Pairing
Many identification schemes have been proposed in which security are based on the intractability of factoring or DLP (Discrete Logarithm Problem). In 2009, Massoud et.al gave identification scheme whose security was based on solving ECDLP (Elliptic Curve Discrete Logarithm Problem). The security of this scheme is improved in order to propose a more secure and efficient scheme. The security of p...
متن کاملZero Knowledge Protocols from Succinct Constraint Detection
We study the problem of constructing proof systems that achieve both soundness and zero knowledge unconditionally (without relying on intractability assumptions). Known techniques for this goal are primarily combinatorial, despite the fact that constructions of interactive proofs (IPs) and probabilistically checkable proofs (PCPs) heavily rely on algebraic techniques to achieve their properties...
متن کاملa comparison of linguistic and pragmatic knowledge: a case of iranian learners of english
در این تحقیق دانش زبانشناسی و کاربردشناسی زبان آموزان ایرانی در سطح بالای متوسط مقایسه شد. 50 دانش آموز با سابقه آموزشی مشابه از شش آموزشگاه زبان مختلف در دو آزمون دانش زبانشناسی و آزمون دانش گفتار شناسی زبان انگلیسی شرکت کردند که سوالات هر دو تست توسط محقق تهیه شده بود. همچنین در این تحقیق کارایی کتابهای آموزشی زبان در فراهم آوردن درون داد کافی برای زبان آموزان ایرانی به عنوان هدف جانبی تحقیق ...
15 صفحه اولInteractive and Noninteractive Zero Knowledge Coincide in the Help Model
We show that a problem in AM has a interactive zero-knowledge proof system if and only if it has a noninteractive zero knowledge proof system in the ‘help model’ of Ben-Or and Gutfreund (J. Cryptology, 2003). In this model, the shared reference string is generated by a probabilistic polynomial-time dealer who is given access to the statement to be proven. Our result holds for both computational...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Security and Communication Networks
سال: 2022
ISSN: ['1939-0122', '1939-0114']
DOI: https://doi.org/10.1155/2022/2791058